Improved Approximation Algorithms for the Min-Max Selecting Items Problem
نویسنده
چکیده
We give a simple deterministic O(logK/ log logK) approximation algorithm for the Min-Max Selecting Items problem, where K is the number of scenarios. While our main goal is simplicity, this result also improves over the previous best approximation ratio of O(logK) due to Kasperski, Kurpisz, and Zieliński (Information Processing Letters (2013)). Despite using the method of pessimistic estimators, the algorithm has a polynomial runtime also in the RAM model of computation. We also show that the LP formulation for this problem by Kasperski and Zieliński (Annals of Operations Research (2009)), which is the basis for the previous work and ours, has an integrality gap of at least Ω(logK/ log logK).
منابع مشابه
Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
Facility Dispersion Problem, originally studied in Operations Research, has recently found important new applications in Result Diversification approach in information sciences. This optimisation problem consists in selecting a small set of p items out of a large set of candidates to maximise a given objective function. The function expresses the notion of dispersion of a set of selected items ...
متن کاملA Approximation Algorithms for Min-Max Generalization Problems
We provide improved approximation algorithms for the min-max generalization problems considered by Du, Eppstein, Goodrich, and Lueker [Du et al. 2009]. Generalization is widely used in privacy-preserving data mining and can also be viewed as a natural way of compressing a dataset. In min-max generalization problems, the input consists of data items with weights and a lower bound wlb, and the go...
متن کاملThe Minimum Expectation Selection Problem
We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to minimize (resp. maximize) the expectation of the minimum value resulting when independent random variables are drawn from the selected distributions. We assume each distribution has finitely many atoms. Let d be the num...
متن کاملImproved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
Given an undirected weighted graph G = (V,E), a set C1, C2, . . . , Ck of cycles is called a cycle cover of V ′ if V ′ ⊂ ∪i=1V (Ci) and its cost is the maximum weight of the cycles. The Min-Max Cycle Cover Problem(MMCCP) is to find a minimum cost cycle cover of V with at most k cycles. The Rooted Min-Max Cycle Cover Problem(RMMCCP) is to find a minimum cost cycle cover of V \D with at most k cy...
متن کاملMulti-Attribute Profit-Maximizing Pricing
In the unlimited-supply profit-maximizing pricing problem, we are given the consumers’ consideration sets and know their purchase strategy (e.g. buy the cheapest items). The goal is to price the items to maximize the revenue. Previous studies suggest that this problem is too general to obtain even a sublinear approximation ratio (in terms of the number of items) even when the consumers are rest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013